Fractional Domination Game

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domination Game

The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible and Staller wishes to delay the process as much as possible. The game domination number γg...

متن کامل

Fractional Roman Domination

A function f : V (G) → {0, 1, 2} is a Roman dominating function if for every vertex with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. We introduce two fractional Roman domination parameters, γR ◦ f and γRf , from relaxations of two equivalent integer programming formulations of Roman domination (the former using open neighborhoods and the later using closed neighborhoods in the Roman...

متن کامل

Fractional domination in prisms

Mynhardt has conjectured that if G is a graph such that γ(G) = γ(πG) for all generalized prisms πG then G is edgeless. The fractional analogue of this conjecture is established and proved by showing that, if G is a graph with edges, then γf (G×K2) > γf (G).

متن کامل

Paired-Domination Game Played in Graphs

In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...

متن کامل

Domination game critical graphs

17 The domination game is played on a graph G by two players who alternately take 18 turns by choosing a vertex such that in each turn at least one previously undominated 19 vertex is dominated. The game is over when each vertex becomes dominated. One 20 of the players, namely Dominator, wants to finish the game as soon as possible, while 21 the other one wants to delay the end. The number of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2019

ISSN: 1077-8926

DOI: 10.37236/8730